On the greedoid polynomial for rooted graphs and rooted digraphs
نویسنده
چکیده
We examine some properties of the 2-variable greedoid polynomial f(G;t, z) when G is the branching greedoid associated to a rooted graph or a rooted directed graph. For rooted digraphs, we show a factoring property of f (G;t ,z) determines whether or not the rooted digraph has a directed cycle.
منابع مشابه
Interval Partitions and Activities for the Greedoid Tutte Polynomial
Ž . The two variable greedoid Tutte polynomial f G; t, z , which was introduced in previous work of the authors, is studied via external activities. Two different partitions of the Boolean lattice of subsets are derived and a feasible set expansion Ž . of f G is developed. All three of these results generalize theorems for matroids. One interval partition yields a characterization of antimatroi...
متن کاملA Greedoid Polynomial Which Distinguishes Rooted Arborescences
We define a two-variable polynomial fa(t, z) for a greedoid G which generalizes the standard one-variable greedoid polynomial A<j(f). Several greedoid invariants (including the number of feasible sets, bases, and spanning sets) are easily shown to be evaluations of fG(t, z). We prove (Theorem 2.8) that when G is a rooted directed arborescence, fo(t, z) completely determines the arborescence. We...
متن کاملExpected rank and randomness in rooted graphs
For a rooted graph G, let EVb(G; p) be the expected number of vertices reachable from the root when each edge has an independent probability p of operating successfully. We determine the expected value of EVb(G; p) for random trees, and include a connection to unrooted trees. We also consider rooted digraphs, computing the expected value of a random orientation of a rooted graph G in terms of E...
متن کاملA characteristic polynomial for rooted graphs and rooted digraphs
We consider the one-variable characteristic polynomial p(G; ) in two settings. When G is a rooted digraph, we show that this polynomial essentially counts the number of sinks in G. When G is a rooted graph, we give combinatorial interpretations of several coe/cients and the degree of p(G; ). In particular, |p(G; 0)| is the number of acyclic orientations of G, while the degree of p(G; ) gives th...
متن کاملWhen bad things happen to good trees
When the edges in a tree or rooted tree fail with a certain fixed probability, the (greedoid) rank may drop. We compute the expected rank as a polynomial in p and as a real number under the assumption of uniform distribution. We obtain several different expressions for this expected rank polynomial for both trees and rooted trees, one of which is especially simple in each case. We also prove tw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 17 شماره
صفحات -
تاریخ انتشار 1993